// Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//

import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1{
static Boolean f_gold ( int arr [ ] , int n ) {
  HashSet < Integer > us = new HashSet < Integer > ( ) ;
  for ( int i = 0 ;
  i < n ;
  i ++ ) us . add ( arr [ i ] ) ;
  int count = 1 ;
  int curr_ele = arr [ 0 ] - 1 ;
  while ( us . contains ( curr_ele ) == true ) {
    count ++ ;
    curr_ele -- ;
  }
  curr_ele = arr [ 0 ] + 1 ;
  while ( us . contains ( curr_ele ) == true ) {
    count ++ ;
    curr_ele ++ ;
  }
  return ( count == ( us . size ( ) ) ) ;
}


//TOFILL

public static void main(String args[]) {
    int n_success = 0;
    List<int [ ]> param0 = new ArrayList<>();
    param0.add(new int[]{15,19,38,59,71});
    param0.add(new int[]{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76});
    param0.add(new int[]{0,0,1,1,1});
    param0.add(new int[]{40,38,17,50,16,35,34,23,3,12,97,53,75,36,3,73,99,11,70,9,23,3,11,9,64,44,62,94,55,69,44,59,57,99,69,12,27,42,14,83,53,4,4});
    param0.add(new int[]{-78,-36,-28,-16,-8,-4,4,4,10,14,30,30,32,32,38,46,54,72});
    param0.add(new int[]{1,0,1,0,0,1,1,0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1});
    param0.add(new int[]{7,32,54,70,79,88});
    param0.add(new int[]{-38,48,-96,-84,10,70,-28,-66,40,-26,-24,-8,28,-6,6,-14,-2,-58,-6,-14,-58,-74,20,32,98,-24,-10,42,-4,-96,-56,-40,74,-98,-86,-94,12,80,10,-54,-44});
    param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1});
    param0.add(new int[]{49,87,18,19,56,25,64,94,43,97,74,79,13,36,72,46,10,84,2,11,41,87,55,38,89,92,65,57,62,16});
    List<Integer> param1 = new ArrayList<>();
    param1.add(3);
    param1.add(26);
    param1.add(4);
    param1.add(26);
    param1.add(16);
    param1.add(38);
    param1.add(5);
    param1.add(30);
    param1.add(12);
    param1.add(21);
    for(int i = 0; i < param0.size(); ++i)
    {
        if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i))))
        {
            n_success+=1;
        }
    }
    System.out.println("#Results:" + n_success + ", " + param0.size());
}
}